The Influence of Link Restrictions on (Random) Selfish Routing

In this paper we consider the influence of link restrictions on the price of anarchy for several social cost functions in the following model of selfish routing. Each of n players in a network game seeks to send a message with a certain length by choosing one of m parallel links. Each player is restricted to transmit over a certain subset of links and desires to minimize his own transmission-time (latency). We study Nash equilibria of the game, in which no player can decrease his latency by unilaterally changing his link. Our analysis of this game captures two important aspects of network traffic: the dependency of the overall network performance on the total traffic t and fluctuations in the length of the respective message-lengths. For the latter we use a probabilistic model in which message lengths are random variables. We evaluate the (expected) price of anarchy of the game for two social cost functions. For total latency cost, we show the tight result that the price of anarchy is essentially Θ (n √ m/t). Hence, even for congested networks, when the traffic is linear in the number of players, Nash equilibria approximate the social optimum only by a factor of Θ ( √ m). This efficiency loss is caused by link restrictions and remains stable even under message fluctuations, which contrasts the unrestricted case where Nash equilibria achieve a constant factor approximation. For maximum latency the price of anarchy is at most 1+m/t. In this case Nash equilibria can be (almost) optimal solutions for congested networks depending on the values for m and t. In addition, our analyses yield average-case analyses of a polynomial time algorithm for computing Nash equilibria in this